Boundary Conforming Delaunay Mesh Generation
نویسنده
چکیده
Many physical phenomena can be modeled by partial differential equations which may be solved by numerical methods such as finite element and finite volume methods. In this context, a given domain must first be subdivided into many simple cells. Both the shape and size of the cells will affect the accuracy and convergence of the method. A boundary conforming Delaunay mesh is a partition of a polyhedral domain into simplices that satisfy the Delaunay and additional criteria. It has many optimal properties and is particularly needed in Voronoi-box-based finite volume schemes [1] which are well-suited for diffusion and transportation problems, such as, porous media flow, semiconduct device simulation, etc. In this paper, we discuss the problem of generating three-dimensional boundary conforming Delaunay meshes with well-shaped tetrahedra and appropriate mesh size.
منابع مشابه
Recent Progress in Robust and Quality Delaunay Mesh Generation
In this paper, some current issues of Delaunay mesh generation and optimization are addressed, with particular emphasis on the robustness of the meshing procedure and the quality of the resulting mesh. We also report new progress on the robust conforming and constrained boundary recovery in three dimensions, along with the quality mesh generation based on Centroidal Voronoi tessellations. Appli...
متن کاملAn Introduction to Algorithms for Constructing Conforming Delaunay Tetrahedrizations
In many computational applications involving 3D geometric modeling, a space decomposition of the problem domain whose elements satisfy some quality constraints is often required. The Delaunay tetrahedrization is a popular choice due to its many important geometric properties and to the existence of efficient algorithms to compute and to maintain it. However, the Delaunay tetrahedrization has a ...
متن کاملConforming restricted Delaunay mesh generation for piecewise smooth complexes
A Frontal-Delaunay refinement algorithm for mesh generation in piecewise smooth domains is described. Built using a restricted Delaunay framework, this new algorithm combines a number of novel features, including: (i) an unweighted, conforming restricted Delaunay representation for domains specified as a (non-manifold) collection of piecewise smooth surface patches and curve segments, (ii) a pr...
متن کاملPolyhedral Mesh Generation and A Treatise on Concave Geometrical Edges
Three methods are investigated to remove the concavity at the boundary edges and/or vertices during polyhedral mesh generation by a dual mesh method. The non-manifold elements insertion method is the first method examined. Concavity can be removed by inserting non-manifold surfaces along the concave edges and using them as an internal boundary before applying Delaunay mesh generation. Conical c...
متن کاملConforming Centroidal Voronoi Delaunay Triangulation for Quality Mesh Generation
As the methodology of centroidal Voronoi tessellation (CVT) is receiving more and more attention in the mesh generation community, a clear characterization of the influence of geometric constraints on the CVT-based meshing is becoming increasingly important. In this paper, we first give a precise definition of the geometrically conforming centroidal Voronoi Delaunay triangulation (CfCVDT) and t...
متن کامل